Developing a guaranteed-accuracy heuristic learning algorithm for travelling salesman problems

This research investigates the feasibility of applying a guaranteed-accuracy heuristic learning algorithm to address the traveling salesman problem. The research focuses on tour construction. The advantage of tour construction heuristic is its simplicity in concept. However, tour construction heuristic often results in a sub-optimal solution and the tour often needs to be improved after it is built by changing the tour configuration until a better solution is found. This paper will describe the application of a real time admissible heuristic learning algorithm that allows the tour configuration to change as the tour is built. A learning threshold approach will also be introduced to allow solution with known quality to be found.